A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
نویسندگان
چکیده
منابع مشابه
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...
متن کاملA regularized smoothing Newton method for solving the symmetric cone complementarity problem
The symmetric cone complementarity problem (denoted by SCCP) is a class of equilibrium optimization problems, and it contains the standard linear/nonlinear complementarity problem (LCP/NCP), the second-order cone complementarity problem (SOCCP) and the semidefinite complementarity problem (SDCP) as special cases. In this paper, we present a regularized smoothing Newton algorithm for SCCP by mak...
متن کاملSmoothing method for mathematical programs with symmetric cone complementarity constraints
In this paper, we consider the mathematical program with symmetric cone complementarity constraints (MPSCCC) in a general form. It includes the mathematical program with second-order-cone complementarity constraints (MPSOCCC) and the mathematical program with complementarity constraints (MPCC). We present a smoothing method which approximates the primal MPSCCC by means of the ChenMangasarian cl...
متن کاملA continuation method for nonlinear complementarity problems over symmetric cone
In this paper, we introduce a new P -type condition for nonlinear functions defined over Euclidean Jordan algebras, and study a continuation method for nonlinear complementarity problems over symmetric cones. This new P -type condition represents a new class of nonmonotone nonlinear complementarity problems that can be solved numerically.
متن کاملComplementarity Functions and Numerical Experiments on Some Smoothing Newton Methods for Second-Order-Cone Complementarity Problems
Two results on the second-order-cone complementarity problem are presented. We show that the squared smoothing function is strongly semismooth. Under monotonicity and strict feasibility we provide a new proof, based on a penalized natural complementarity function, for the solution set of the second-order-cone complementarity problem being bounded. Numerical results of squared smoothing Newton a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2008
ISSN: 1052-6234,1095-7189
DOI: 10.1137/060676775